Nearest Singular Polynomials

نویسندگان

  • Lihong Zhi
  • Wenda Wu
چکیده

The nearest singular polynomials to a given polynomial have been studied in [1], based on minimization of quadratic forms. An equivalent expression of the quadratic form is presented. It leads to a simple equation satisfied by the double zeros of the nearest singular polynomials. The amount of computational work is economized.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Method for Computing the Nearest Singular Polynomials

In this paper, we propose a combined symbolic-numeric algorithm for computing the nearest singular polynomial and its multiple zero. Explicit expressions of the minimal perturbation and the nearest singular polynomials are presented. A theoretical error bound and several numerical examples are given.

متن کامل

Solving singular integral equations by using orthogonal polynomials

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...

متن کامل

Computing the nearest singular univariate polynomials with given root multiplicities

In this paper, we derive explicit expressions for the nearest singular polynomials with given root multiplicities and its distance to the given polynomial. These expressions can be computed recursively. These results extend previous results of (Zhi et al., 2004; Zhi and Wu, 1998).

متن کامل

Using Riemannian SVD for Problems in Approx- imate Algebra

Many fundamental problems for approximate polynomials can be reformulated as structured linear approximation problems. Problems such as finding polynomials with a GCD which are nearest to given relatively prime polynomials, finding the nearest Ore polynomials with a non-trivial GCRD, finding the nearest polynomial which functionally decomposes, and finding the nearest multivariate polynomial wh...

متن کامل

A spectral method based on Hahn polynomials for solving weakly singular fractional order integro-differential equations

In this paper, we consider the discrete Hahn polynomials and investigate their application for numerical solutions of the fractional order integro-differential equations with weakly singular kernel .This paper presented the operational matrix of the fractional integration of Hahn polynomials for the first time. The main advantage of approximating a continuous function by Hahn polynomials is tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 26  شماره 

صفحات  -

تاریخ انتشار 1998